Resources, Concurrency and Local Reasoning
نویسنده
چکیده
In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.
منابع مشابه
Permission-Based Separation Logic for Message-Passing Concurrency
We develop local reasoning techniques for message passing concurrent programs basedon ideas from separation logics and resource usage analysis. We extend processes with permission-resources and define a reduction semantics for this extended language. This provides a foundationfor interpreting separation formulas for message-passing concurrency. We also define a sound proofsystem...
متن کاملGlobal and Local Monitors to Enforce Noninterference in Concurrent Programs
Controlling confidential information in concurrentsystems is difficult, due to covert channels resulting from inter-action between threads. This problem is exacerbated if threadsshare resources at fine granularity.In this work, we propose a novel monitoring framework toenforce strong information security in concurrent programs. Ourmonitors are hybrid, combining dynamic a...
متن کاملReverse Exchange for Concurrency and Local Reasoning
Recent research has pointed out the importance of the inequational exchange law (P ∗Q) ; (R∗S) ≤ (P ;R)∗ (Q ;S) for concurrent processes. In particular, it has been shown that this law is equivalent to validity of the concurrency rule for Hoare triples. Unfortunately, the law does not hold in the relationally based setting of algebraic separation logic. However, we show that under mild conditio...
متن کاملThesis Proposal Verifying Concurrent Randomized Algorithms
Concurrency and randomization are two programming features that are notoriously difficult to use correctly. This is because programs that use them no longer behave deterministically, so programmers must take into account the set of all possible interactions and random choices that may occur. A common approach to reasoning about complex programs is to use relational or refinement reasoning: to u...
متن کاملChapter 1 An Overview
Separation logic is a novel system for reasoning about imperative programs. It extends Hoare logic with enriched assertions that can describe the separation of storage and other resources concisely. The original goal of the logic was to facilitate reasoning about shared mutable data structures, i.e., structures where updatable fields can be referenced from more than one point. More recently, th...
متن کامل